Isomorphisms of scattered automatic linear orders

نویسنده

  • Dietrich Kuske
چکیده

We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable. For the existence of automatic automorphisms of word automatic linear orders, we determine the exact level of undecidability in the arithmetical hierarchy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tree-automatic scattered linear orders

We study tree-automatic linear orders on regular tree languages. We first show that there is no tree-automatic scattered linear order, and in particular no well-order, on the set of all finite labeled trees. This also follows from results of Gurevich-Shelah [8] and Carayol-Löding [4]. We then show that a regular tree language admits a tree-automatic scattered linear order if and only if all tre...

متن کامل

On Scattered Posets with Finite Dimension

We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains. Introduction and presentation of the results A fundamental result, due to Szpilrajn [26], states that every order on a set is the intersection of a family of linear orders on this set. The dimension of the order, also called the dimension o...

متن کامل

Minimality of Non Σ-scattered Orders

In this paper we will characterize — under appropriate axiomatic assumptions — when a linear order is minimal with respect to not being a countable union of scattered suborders. We show that, assuming PFA, the only linear orders which are minimal with respect to not being σ-scattered are either Countryman types or real types. We also outline a plausible approach to demonstrating the relative co...

متن کامل

Isomorphisms in unital $C^*$-algebras

It is shown that every  almost linear bijection $h : Arightarrow B$ of a unital $C^*$-algebra $A$ onto a unital$C^*$-algebra $B$ is a $C^*$-algebra isomorphism when $h(3^n u y) = h(3^n u) h(y)$ for allunitaries  $u in A$, all $y in A$, and all $nin mathbb Z$, andthat almost linear continuous bijection $h : A rightarrow B$ of aunital $C^*$-algebra $A$ of real rank zero onto a unital$C^*$-algebra...

متن کامل

Uncountable Linear Orders

Two important classes of linear orders that are not σ-scattered are the real types and the Aronszajn types: the real types are those uncountable dense linear orders that are separable; the Aronszajn types are those linear orders that are uncountable and yet have no uncountable suborders that are scattered or real types. This latter class was considered—and proved nonempty—long ago by Aronszajn ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 533  شماره 

صفحات  -

تاریخ انتشار 2012